/*
  Copyright (C) 2011, Kyungjoo Kim
  
  This file is part of LINAL (LINear ALgebra)
  
  All rights reserved.

  This library is free software; you can redistribute it and/or
  modify it under the terms of the GNU Lesser General Public
  License as published by the Free Software Foundation; either
  version 2.1 of the License, or (at your option) any later version.
  
  This library is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  Lesser General Public License for more details.
  
  You should have received a copy of the GNU Lesser General Public
  License along with this library; if not, write to the Free Software
  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  Also add information on how to contact you by electronic and paper mail.
  
  
  Kyungjoo Kim
  iamkyungjoo@gmail.com
*/
#include "linal/common.hxx"
#include "linal/const.hxx"
#include "linal/util.hxx"
#include "linal/matrix.hxx"
#include "linal/flat.hxx"
#include "linal/hier.hxx"
#include "linal/operation.hxx"

namespace linal {
  void head_graphviz(FILE *fp, char *name) { 
    fprintf(fp, "digraph %s { \n", name);  
  }
  void tail_graphviz(FILE *fp) {
    fprintf(fp, "} \n");
  }
  
  int push_graphviz(Hier_ A, int begin, 
		    std::vector< std::pair<int,double> > &viz) {
    viz.clear();
    for (int k2=0;k2<A.get_n();++k2) {
      for (int k1=0;k1<A.get_m();++k1) {
	std::pair<int,double> in;
	in.first  = begin++;
	in.second = sqrt(A(k1,k2).m * A(k1,k2).n);
	viz.push_back(in);
      }
    }
    return begin;
  }

  void write_graphviz(FILE *fp, char *task, char *style, char *color,
		      std::vector< std::pair<int,double> > &viz_in,
		      std::vector< std::pair<int,double> > &viz_out) {
    std::vector< std::pair<int,double> >::iterator in, out;
    for (in=viz_in.begin();in<viz_in.end();++in) {
      fprintf(fp, "%d [label=\"%s\",style=%s,color=%s]; %d -> {",
	     in->first, task, style, color, in->first);

      for (out=viz_out.begin();out<viz_out.end();++out) {
	fprintf(fp,"%d;",out->first);

      }
      fprintf(fp,"};\n");
    }      
  }
}
